Preference, Rationalizability and Equilibrium
نویسنده
چکیده
In the context of finite normal form games, this paper addresses the formalization and implications of the hypothesis that players are rational and that this is common knowledge. The innovation is to admit notions of rationality other than subjective expected utility maximization. For example, rationality can be defined by the alternative restrictions that preferences are probabilistically sophisticated, conform to the multiple-priors model or are monotonic. The noted hypothesis is related to suitably defined notions of correlated rationalizability, survival of iterated deletion of strictly dominated strategies and a posteriori equilibrium. Journal of Economic Literature Classification Numbers: C72, D81. 1997 Academic Press
منابع مشابه
The Complexity of Nash Rationalizability
The observed choices of a set of players interacting in various related games are said to be Nash rationalizable if there exist preferences for the players that make those choices the pure strategy Nash equilibria for each game. We provide an intuitive characterization of Nash rationalizability under less restrictive conditions than those in the existing literature, and show that this restricte...
متن کاملSequential and quasi-perfect rationalizability in extensive games
Within an epistemic model for two-player extensive games, we formalize the event that each player believes that his opponent chooses rationally at all information sets. Letting this event be common certain belief yields the concept of sequential rationalizability. Adding preference for cautious behavior to this event likewise yields the concept of quasi-perfect rationalizability. These concepts...
متن کاملGames in Preference Form and Preference Rationalizability
We introduce a game in preference form, which consists of a game form and a preference structure, and define preference rationalizability that allows for each player’s ex-post preferences over outcomes to depend on opponents’ actions. We show that preference rationalizability is invariant to redundant types and states as long as all players have simplex restrictions on their ex-post preferences...
متن کاملOn randomized rationality
In contrast to the traditional notion of rationalizability of stochastic choice which requires the preference relations to be strict, we propose a notion of rationalizability without requiring the preference relations to be strict. Our definition is based on the simple hypothesis of a two stage choice process: stage (i) a preference relation R is drawn according to a probability assignment; sta...
متن کاملPseudo-rationalizability over Infinite Choice Spaces
A dominant concern in rational choice theory is rationalizability of choice functions. Rationalizability demands that a choice function can be represented by a preference relation according to which the choice function selects for each decision problem those alternatives which are most preferred (or undominated by other alternatives). A less demanding notion demands that a choice function can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997